A computational algorithm for the CPP/M/c retrial queue

نویسنده

  • Tien Van Do
چکیده

This paper introduces the retrial CPP/M/c queue, which is the generalization of the M/M/c retrial queue. The arrival process of jobs into the queue follows the Compound Poisson Process (CPP). We present an efficient and numerically stable computational algorithm for the steady state probabilities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new multi-mode and multi-product hub covering problem‎: ‎A priority M/M/c queue ‎approach

One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...

متن کامل

A stochastic version analysis of an M/G/1 retrial queue with Bernoulli‎ ‎schedule‎

‎In this work‎, ‎we derive insensitive bounds for various performance measures of a single-server‎ ‎retrial queue with generally distributed inter-retrial times and Bernoulli schedule‎, ‎under the special‎ ‎assumption that only the customer at the head of the orbit queue (i.e.‎, ‎a‎ ‎FCFS discipline governing the flow from the orbit to the server) is allowed‎ ‎to occupy the server‎. ‎The method...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

Bernoulli Vacation Policy for a Bulk Retrial Queue with Fuzzy Parameters

In this paper, we investigate the fuzzy logic based system characteristics of MX/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have...

متن کامل

Unreliable bulk retrial queues with delayed repairs and modified vacation policy

The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009